Computability theory

Results: 1231



#Item
271Statistical inference / Reasoning / Computability theory / Turing machine / Epistemology / Inductive inference / Inductive reasoning / Inference / Kolmogorov complexity / Science / Logic / Knowledge

Computationally-based Agnostic Induction/Inference Terrence L. Fine School of Electrical & Computer Engrng Cornell University UCB on 29 November 2007

Add to Reading List

Source URL: hplms.berkeley.edu

Language: English - Date: 2015-03-14 17:56:40
272Computability theory / Inductive inference / Year of birth missing

Prescribed Learning of R.E. Classes Sanjay Jain1, , Frank Stephan2,∗ , and Nan Ye2 1 Department of Computer Science, National University of Singapore, Singapore, Republic of Singapore

Add to Reading List

Source URL: www.comp.nus.edu.sg

Language: English - Date: 2013-03-09 06:29:28
273Models of computation / Theoretical computer science / Functions and mappings / Calculus / Ω-automaton / Finite state transducer / Continuous function / Derivative / Computability / Automata theory / Mathematics / Mathematical analysis

Regular Real Analysis Swarat Chaudhuri Rice University Sriram Sankaranarayanan

Add to Reading List

Source URL: www.cs.rice.edu

Language: English - Date: 2013-04-26 17:57:31
274Mathematical logic / Computable function / Computable number / Computable analysis / Computable real function / Specker sequence / Enumeration / Computability / Numbering / Computability theory / Theory of computation / Theoretical computer science

Preface Computable analysis is a branch of computability theory studying those functions on the real numbers and related sets which can be computed by machines such as digital computers. The increasing demand for reliab

Add to Reading List

Source URL: www.fernuni-hagen.de

Language: English - Date: 2009-09-05 02:34:00
275Functions and mappings / Model theory / Computability theory / Interpretation / Philosophy of mind / Semantics / Primitive recursive function / Function / First-order logic / Mathematical logic / Mathematics / Logic

Well-founded Recursion over Contextual Objects Brigitte Pientka1 and Andreas Abel2 1 2

Add to Reading List

Source URL: www2.tcs.ifi.lmu.de

Language: English - Date: 2015-02-07 05:55:59
276Theory of computation / Recursively enumerable set / Enumeration / Model theory / Presentation of a group / Ordinal number / Ω-consistent theory / Mathematics / Mathematical logic / Computability theory

PRELIMINARY EXAMINATION GROUP IN LOGIC AND THE METHODOLOGY OF SCIENCE For the following questions we fix a standard enumeration h ϕe : e ∈ ω i of the partial recursive functions with the corresponding enumeration hWe

Add to Reading List

Source URL: logic.berkeley.edu

Language: English
277Mathematical logic / Computability theory / Lambda calculus / Proof theory / Orbifold / Natural deduction / Theoretical computer science / Models of computation / Applied mathematics

Full reduction in the face of absurdity Gabriel Scherer, Didier R´emy Gallium – INRIA October 28, 2014

Add to Reading List

Source URL: gallium.inria.fr

Language: English - Date: 2014-10-28 06:28:38
278Recursion / Programming idioms / Theoretical computer science / Computability theory / Self-reference / Haskell / Pattern matching / Map / Infinite loop / Computer programming / Software engineering / Computing

DRAFT of June 27, 2013 Wellfounded Recursion with Copatterns A Unified Approach to Termination and Productivity Andreas Abel

Add to Reading List

Source URL: www2.tcs.ifi.lmu.de

Language: English - Date: 2013-06-27 12:30:39
279Higher-order functions / Recursion / Functions and mappings / Computability theory / Fold / Lambda calculus / Map / Function / Antiderivative / Mathematics / Mathematical analysis / Computing

Lightweight Fusion by Fixed Point Promotion ∗ (the author’s version) Isao Sasano † Atsushi Ohori

Add to Reading List

Source URL: www.sic.shibaura-it.ac.jp

Language: English - Date: 2008-10-23 00:04:30
280Mathematical logic / Theory of computation / Computable number / Computable function / Bounded quantifier / Computable real function / Function / Oracle machine / Decision problem / Computability theory / Theoretical computer science / Mathematics

arXiv:1204.6671v1 [cs.LO] 30 Apr 2012 δ-Decidability over the Reals∗ Sicun Gao, Jeremy Avigad, and Edmund M. Clarke Carnegie Mellon University, Pittsburgh, PAMay 1, 2012

Add to Reading List

Source URL: arxiv.org

Language: English - Date: 2012-04-30 22:29:41
UPDATE